Manifold-Regularized Selectable Factor Extraction for Semi-supervised Image Classification
نویسندگان
چکیده
Feature selection methods are efficient in modern computer vision applications to reduce the computational cost and the chance of over-fitting. Recently, a novel selectable factor extraction (SFE[3]) framework is proposed to simultaneously perform feature selection and extraction, and is theoretically and practically proved to be effective for high-dimensional data. Although it is advantageous in several aspects, SFE is only designed for either supervised or unsupervised learning, and is not suitable when there are limited labeled samples and a large number of unlabeled samples. To tackle this problem, we propose a novel manifold regularized SFE (MRSFE) framework for semi-supervised image classification. We use a low rank penalized regression model to explore the label information. A low rank matrix of the regression coefficients, together with the `2,1 or `2,0 norm penalty is learned for joint feature selection and extraction. In addition, all the labeled and unlabeled samples are utilized in MRSFE to construct the data adjacency graph to approximate the underlying data manifold, which the data distribution is assumed to be supported on. The graph Laplacian is then incorporated as a regularization term to smooth the coefficients matrix. In this way, the local structures of the whole dataset are preserved, and the data distribution is well exploited. To derive our model, we begin with the reduced rank regression (RRR) model[1]: min B ‖YL−XLB‖F , s.t. rank(B)≤ r. (1)
منابع مشابه
Linear Manifold Regularization for Large Scale Semi-supervised Learning
The enormous wealth of unlabeled data in many applications of machine learning is beginning to pose challenges to the designers of semi-supervised learning methods. We are interested in developing linear classification algorithms to efficiently learn from massive partially labeled datasets. In this paper, we propose Linear Laplacian Support Vector Machines and Linear Laplacian Regularized Least...
متن کاملSemi-supervised manifold learning approaches for spoken term verification
In this paper, the application of semi-supervised manifold learning techniques to the task of verifying hypothesized occurrences of spoken terms is investigated. These techniques are applied in a two stage spoken term detection framework where ASR lattices are first generated using a large vocabulary ASR system and hypothesized occurrences of spoken query terms in the lattices are verified in a...
متن کاملWeb Page Classification Based on Uncorrelated Semi-Supervised Intra-View and Inter-View Manifold Discriminant Feature Extraction
Web page classification has attracted increasing research interest. It is intrinsically a multi-view and semi-supervised application, since web pages usually contain two or more types of data, such as text, hyperlinks and images, and unlabeled pages are generally much more than labeled ones. Web page data is commonly high-dimensional. Thus, how to extract useful features from this kind of data ...
متن کاملSemi-Supervised Based Hyperspectral Imagery Classification
Hyperspectral imagery classification is a challenging problem. Wherein, the high number of spectral channels and the high cost of true sample labeling greatly reduce the classification precision. In this paper, we proposed a semi-supervised method, which combine linear discriminant analysis and manifold learning, to improve the precision of hyperspectral imagery classification. Experimental res...
متن کاملکاهش ابعاد دادههای ابرطیفی به منظور افزایش جداییپذیری کلاسها و حفظ ساختار داده
Hyperspectral imaging with gathering hundreds spectral bands from the surface of the Earth allows us to separate materials with similar spectrum. Hyperspectral images can be used in many applications such as land chemical and physical parameter estimation, classification, target detection, unmixing, and so on. Among these applications, classification is especially interested. A hyperspectral im...
متن کامل